Asymptotics of Classical Spin Networks Stavros Garoufalidis and Roland Van Der Veen

On the volume conjecture for classical spin networks

We prove an upper bound for the evaluation of all classical SU2 spin networks conjectured by Garoufalidis and van der Veen. This implies one half of the analogue of the volume conjecture which they proposed for classical spin networks. We are also able to obtain the other half, namely, an exact determination of the spectral radius, for the special class of generalized drum graphs. Our proof use...

Asymptotics of quantum spin networks

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

Asymptotics of Classical Spin Networks

A spin network consists of a cubic ribbon graph (i.e., an abstract trivalent graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The evaluation of a spin network, with our normalization, is an integer number. The main results of our paper are: (a) an existence theorem for the asymptotics of evaluations of arbitrary spin netw...

Asymptotics of Quantum Spin Networks at a Fixed Root of Unity

A classical spin network consists of a ribbon graph (i.e., an abstract graph with a cyclic ordering of the vertices around each edge) and an admissible coloring of its edges by natural numbers. The standard evaluation of a spin network is an integer number. In a previous paper, we proved an existence theorem for the asymptotics of the standard evaluation of an arbitrary classical spin network w...

I-30: Prediction Models in IVF